Parallelizing the Mace Model Checker
نویسنده
چکیده
In this project, we endeavored to parallelize MaceMC, a model checker for distributed systems written in Mace. Preliminary results show that the parallelized model checker can increase the number of useful states explored by the model checker by a factor of 50 for relatively modest cluster sizes.
منابع مشابه
Parallelizing the Spin Model Checker
We describe an extension of the Spin model checker that allows us to take advantage of the increasing number of cpu-cores available on standard desktop systems. Our main target is to speed up the verification process for safety properties, the mode used most frequently, but we also describe a small modification of the parallel search algorithm, called the piggyback algorithm, that is remarkably...
متن کاملParallelizing A Model Checker
A new parallel algorithm that performes CTL model checking is given and its performance evaluated. It is based on a matrix representation of the computational model, which is distributed among the processing elements. The algorithm has been implemented on a Transputer-based architecture Meiko CS/1. Experimental results and analytical modeling are presented here that show the \good" parallel beh...
متن کاملModel Checking as a Tool Used by Parallelizing Compilers
In this paper we describe the usage of temporal logic and model checking in a parallelizing compiler to analyze the structure of a source program and locate opportunities for optimization and parallelization. The source program is represented as a process graph in which the nodes are sequential processes and the edges are control and data dependence relationships between the computations at the...
متن کاملModel Checking Tools for Parallelizing Compilers
In this paper we apply temporal logic and model checking to analyze the structure of a source program represented as a process graph. The nodes of this graph are sequential processes whose computations are speciied as transition systems; the edges are dependence ((ow and control) relations between the computations at the nodes. This process graph is used as an intermediate source program repres...
متن کاملParallelizing Assignment Problem with DNA Strands
Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008